Hamiltonian path problem - PDFSEARCH.IO - Document Search Engine

Hamiltonian path problem
Results: 50

#	Item
11	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-12-14 14:46:08 NP-complete problems Circular-arc graph Longest path problem Hamiltonian path Interval graph Intersection graph Independent set Graph theory Pathwidth Trapezoid graph
12	SIAM J. DISCRETE MATH. Vol. 26, No. 3, pp. 940–963 c 2012 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-10-09 12:22:03 NP-complete problems Search algorithms Permutation graph Chordal graph Graph Permutation Longest path problem Hamiltonian path Comparability graph Depth-first search Interval graph Skew-symmetric graph
13	Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5 Add to Reading List Source URL: pbil.univ-lyon1.fr Language: English - Date: 2008-10-22 02:35:19 Complexity classes Flux balance analysis NP Matrix Matching Hamiltonian path problem Sharp-P-complete Hypergraph Computational complexity theory Stoichiometry P Bipartite graph
14	Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios · Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-12-14 14:10:08 NP-complete problems Interval graph Strongly chordal graph Hamiltonian path Longest path problem Chordal graph Indifference graph Permutation graph Path Pathwidth Graph minor
15	Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2009-12-21 16:02:55 NP-complete problems Trapezoid graph Interval graph Perfect graph Indifference graph Independent set Permutation graph Clique problem Hamiltonian path problem Longest path problem Pathwidth Intersection graph
16	DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2010-06-13 16:41:26 Graph theory Mathematics NP-complete problems NP-hard problems Graph coloring Routing algorithms Search algorithms Hamiltonian path Bipartite graph Travelling salesman problem A* search algorithm Planar separator theorem
17	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph
18	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar Add to Reading List Source URL: www.statistics.du.se Language: English - Date: 2014-04-22 07:57:30 NP-complete problems Travelling salesman problem Induced path Shortest path problem Graph Routing Combinatorial optimization Path Hamiltonian path Graph theory Theoretical computer science Mathematics
19	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
20	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:18 Network flow Hamiltonian path Maximum flow problem Ford–Fulkerson algorithm Flow network Tree decomposition Minimum spanning tree Graph theory Mathematics Theoretical computer science

UPDATE